Iterative Dual Rational Krylov and Iterative SVD-Dual Rational Krylov Model Reduction for Switched Linear Systems
نویسندگان
چکیده
In this paper, we propose two models reduction algorithms for approximation of large-scale linear switched systems. We present at first the iterative dual rational krylov approach, that construct a union of krylov subspaces. The iterative dual rational Krylov is low in cost, numerical efficient but the stability of reduced system is not always guaranteed. In the second part we present, the iterative SVD-Dual Rational Krylov approach. This method is a combining of two sidedprojections, one side is generated by the dual Rational krylovbased model reduction techniques and the other side is generated by the SVD model reduction techniques, while the SVD-side depends on the observability gramian. This method is numerical efficient, minimize the H∞ Error between the original switched system and reduced one and preserved always the stability of reduced systems. A simulation two examples are considered in order to take a performance study of these proposed approaches.
منابع مشابه
On the $\mathcal{H}_2$ norm and iterative model order reduction of linear switched systems
A new definition of the H2 norm for linear switched systems is introduced. It is based on appropriately defined time-domain kernels, or equivalently, on infinite controllability and observability Gramian matrices. Furthermore, an extension of the iterative rational Krylov algorithm to the class of linear switched systems is proposed.
متن کاملA Parametric Model Order Reduction Method Using the Loewner Framework and the Iterative Rational Krylov Algorithm
Linear dynamical systems play a large role in predicting the behavior of physical phenomena, and computational efficient methods of forming solutions to these systems are of great interest. These systems often depend on a set of physical parameters, and it can be the case that solutions are required for many different sets of parameter values. Systems of this nature can also be of large dimensi...
متن کاملUsing Generalized Cayley Transformations within an Inexact Rational Krylov Sequence Method
The rational Krylov sequence (RKS) method is a generalization of Arnoldi's method. It constructs an orthogonal reduction of a matrix pencil into an upper Hessenberg pencil. The RKS method is useful when the matrix pencil may be eeciently factored. This article considers approximately solving the resulting linear systems with iterative methods. We show that a Cayley transformation leads to a mor...
متن کاملRecycling BiCG with an Application to Model Reduction
Science and engineering problems frequently require solving a sequence of dual linear systems. Besides having to store only few Lanczos vectors, using the BiConjugate Gradient method (BiCG) to solve dual linear systems has advantages for specific applications. For example, using BiCG to solve the dual linear systems arising in interpolatory model reduction provides a backward error formulation ...
متن کاملConvergence of the Iterative Rational Krylov Algorithm
The iterative rational Krylov algorithm (IRKA) of Gugercin et al. (2008) [8] is an interpolatory model reduction approach to the optimal H2 approximation problem. Even though the method has been illustrated to show rapid convergence in various examples, a proof of convergence has not been provided yet. In this note, we show that in the case of state-space-symmetric systems, IRKA is a locally co...
متن کامل